منابع مشابه
Min-Max Kullback-Leibler Model Selection
This paper considers an information theoretic min-max approach to the model selection problem. The aim of this approach is to select the member of a given parameterized family of probability models so as to minimize the worst-case KullbackLeibler divergence from an uncertain “truth” model. Uncertainty of the truth is specified by an upper-bound of the KL-divergence relative to a given reference...
متن کاملReconstruction of 3D Plane using Min-Max Approach
In this paper, a new approach for the reconstruction of a 3D plane by solving the geometry of two perspective projections of the plane is presented. It is assumed that the position and the orientation of one camera are known with respect to the other one. The correspondence between the object space and image planes is established using the collinearity equation. The projection of the original p...
متن کاملMin-max and min-max (relative) regret approaches to representatives selection problem
The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision....
متن کاملStock Portfolio Selection using Data Mining Approach
Once it is decided that investment is to be made in the stock, the obvious question which arises is: which all stocks should be purchased? Past performance will not guarantee the future, but it is still worthwhile to evaluate the investments based on their ability to deliver consistent returns with minimal risk. Therefore, the ability to generate most profitable return from short term stock tra...
متن کاملInferring Min and Max Invariants Using Max-Plus Polyhedra
We introduce a new numerical abstract domain able to infer min and max invariants over the program variables, based on max-plus polyhedra. Our abstraction is more precise than octagons, and allows to express non-convex properties without any disjunctive representations. We have defined sound abstract operators, evaluated their complexity, and implemented them in a static analyzer. It is able to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vikalpa: The Journal for Decision Makers
سال: 2012
ISSN: 0256-0909,2395-3799
DOI: 10.1177/0256090920120206